The Evolution of a Kernel-Based Distance Metric for k-NN Regression
نویسندگان
چکیده
k-Nearest Neighbours (k-NN) is a well understood and widely-used approach to classification and regression problems. In many cases, such applications of k-NN employ the standard Euclidean distance metric for the determination of the set of nearest neighbours to a particular test data sample. This paper investigates the use of a data-driven evolutionary approach, named KTree, for the automatic construction of a kernel-based distance metric as an alternative to Euclidean distance. The key idea behind this approach is that a different distance metric is generated for a particular data domain. The performance of k-NN with the standard Euclidean distance measure is compared with that of k-NN based on a kernel-based distance metric evolved by KTree. This comparison is based on experiments on both synthetic and real-world datasets.
منابع مشابه
یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیکهای یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملData Dependent Distance Metric for Efficient Gaussian Processes Classification
The contributions of this work are threefold. First, various metric learning techniques are analyzed and systematically studied under a unified framework to highlight the criticality of data-dependent distance metric in machine learning. The metric learning algorithms are categorized as naive, semi-naive, complete and high-level metric learning, under a common distance measurement framework. Se...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملA robust least squares fuzzy regression model based on kernel function
In this paper, a new approach is presented to fit arobust fuzzy regression model based on some fuzzy quantities. Inthis approach, we first introduce a new distance between two fuzzynumbers using the kernel function, and then, based on the leastsquares method, the parameters of fuzzy regression model isestimated. The proposed approach has a suitable performance to<b...
متن کامل